Multiport Interaction Nets and Concurrency
نویسنده
چکیده
We consider an extension of Lafont’s Interaction Nets, called Multiport Interaction Nets, and show that they are a model of concurrent computation by encoding the full π-calculus in them. We thus obtain a faithful graphical representation of the π-calculus in which every reduction step is decomposed in fully local graph-rewriting rules.
منابع مشابه
A Hierarchy of Expressiveness in Concurrent Interaction Nets
We give separation results, in terms of expressiveness, concerning all the concurrent extensions of interaction nets defined so far in the literature: we prove that multirule interaction nets (of which Ehrhard and Regnier’s differential interaction nets are a special case) are strictly less expressive than multiwire interaction nets (which include Beffara and Maurel’s concurrent nets and Honda ...
متن کاملToken Machines for Multiport Interaction Combinators
Game semantics [7, 1] and the Geometry of Interaction [6] are semantic frameworks centered around the dynamic, interactive behaviour of the interpreted object rather than on its static, extensional properties. The obtained semantics is often fully abstract, and its concreteness can be exploited in the definition of compilation schemes towards low-level languages, like in the Geometry of Synthes...
متن کاملModeling Agent Conversations with Colored Petri Nets
Conversations are a useful means of structuring communicative interactions among agents. The value of a conversationbased approach is largely determined by the conversational model it uses. Finite State Machines, used heavily to date for this purpose, are not su cient for complex agent interactions requiring a notion of concurrency. We propose the use of Colored Petri Nets as a model underlying...
متن کاملStatic Analysis Versus Model Checking for Bug Finding
The benefits of exposing calls and returns p. 2 A compositional approach to the stochastic dynamics of gene networks p. 4 Games other people play p. 5 Type-directed concurrency p. 6 Multiport interaction nets and concurrency p. 21 Model checking for [pi]-calculus using proof search p. 36 A game semantics of the asynchronous [pi]-calculus p. 51 Efficient on-the-fly algorithms for the analysis of...
متن کاملA component-based Petri net model for specifying and validating cooperative information systems
This paper presents fundamentals of a novel framework adequately tailored for specifying and validating complex information systems as fully distributed, autonomous yet cooperating components. The proposed framework, referred to as CO-NETS, is a multi-paradigm soundly integrating object-oriented (OO) structuring mechanisms, modularity concepts and some constructions from semantical data modelin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005